全文获取类型
收费全文 | 695篇 |
免费 | 314篇 |
国内免费 | 50篇 |
出版年
2024年 | 1篇 |
2023年 | 7篇 |
2022年 | 11篇 |
2021年 | 11篇 |
2020年 | 13篇 |
2019年 | 18篇 |
2018年 | 13篇 |
2017年 | 48篇 |
2016年 | 48篇 |
2015年 | 43篇 |
2014年 | 67篇 |
2013年 | 62篇 |
2012年 | 46篇 |
2011年 | 46篇 |
2010年 | 39篇 |
2009年 | 72篇 |
2008年 | 45篇 |
2007年 | 51篇 |
2006年 | 67篇 |
2005年 | 57篇 |
2004年 | 48篇 |
2003年 | 27篇 |
2002年 | 25篇 |
2001年 | 26篇 |
2000年 | 26篇 |
1999年 | 23篇 |
1998年 | 19篇 |
1997年 | 16篇 |
1996年 | 10篇 |
1995年 | 11篇 |
1994年 | 9篇 |
1993年 | 14篇 |
1992年 | 9篇 |
1991年 | 10篇 |
1990年 | 14篇 |
1989年 | 6篇 |
1988年 | 1篇 |
排序方式: 共有1059条查询结果,搜索用时 281 毫秒
101.
102.
Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming 下载免费PDF全文
It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code. 相似文献
103.
In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
104.
105.
谢广英 《中国人民武装警察部队学院学报》2008,24(7):38-40
仅有推理公式而没有明确的关系性质,推理无法进行;关系性质虽然确定,却用文字加以说明,推理就是非形式的。怎样摆脱这种两难困境?出路就在于正确揭示关系推理的结构关系并将之符号化。这对完善普通逻辑或关系理论有重要意义。 相似文献
106.
In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
107.
先验分布的确定与表示是Bayes统计推断的出发点和关键点。提出了一种基于信仰推断 (FiducialInfer ence)观点确定Bayes先验分布的设想 ,有助于解决无验前信息或验前历史信息较少时先验分布的确定问题 ,文中给出了一个实例说明了该方法的应用 相似文献
108.
研究了机动目标宽带线性调频脉冲回波全去斜率信号模型,根据速度和加速度的调频频谱展宽特点,提出了机动目标宽带一维距离像线性化调频回波模型,给出了Radon模糊图转换(RAT)法线性参数估计与运动补偿方法,并进一步分析了测速和测距误差.仿真实验验证了RAT法一维距离像线性化参数估计与补偿,表明该方法很好地解决了运动参数未知情况下机动目标的一维距离像频谱展宽问题. 相似文献
109.
分数阶傅立叶变换(FRFT)是傅立叶变换的广义形式,对线性调频(LFM)信号具有很好的能量积累作用.针对反辐射导弹(ARM)雷达回波信号的线性调频特性,提出了一种基于FRFT的反辐射导弹检测方法,并根据ARM信号的调频特性将FRFF局域化,缩小了峰值搜索区域,提高了检测效率.仿真实验表明该方法能够在高斯、非高斯分布杂波环境下有效地检测ARM信号. 相似文献
110.
In this paper, a condition-based maintenance model for a multi-unit production system is proposed and analyzed using Markov renewal theory. The units of the system are subject to gradual deterioration, and the gradual deterioration process of each unit is described by a three-state continuous time homogeneous Markov chain with two working states and a failure state. The production rate of the system is influenced by the deterioration process and the demand is constant. The states of the units are observable through regular inspections and the decision to perform maintenance depends on the number of units in each state. The objective is to obtain the steady-state characteristics and the formula for the long-run average cost for the controlled system. The optimal policy is obtained using a dynamic programming algorithm. The result is validated using a semi-Markov decision process formulation and the policy iteration algorithm. Moreover, an analytical expression is obtained for the calculation of the mean time to initiate maintenance using the first passage time theory. 相似文献